How SAGE helps to implement Goppa Codes and McEliece PKCSs
نویسنده
چکیده
Common cryptographic methods, especially Public Key Crypto Systems, PKCS based on difficulty to factor large integers or to compute the discrete logarithm, commonly deployed today will not resist attacks using quantum computers once these are operational. However, there are alternatives like hash based digital signature schemes, lattice based cryptography, or multivariate-quadratic-equations public-key cryptography. Here, we present ways to judiciously implement code based cryptography exemplified by the McEliece PKCS based on Goppa Codes. We will show how the open source computer algebra system SAGE can guide the implementation of the PKCS say on FPGAs.
منابع مشابه
Generating Goppa Codes
Once quantum computers become operational all current public key crypto systems, PKCSs become obsolete. Fortunately, there are alternative quantum computer robust methods based on coding, on hashing, on multivariate polynomials, on lattices etc. One such candidate is the McEliece PKCS which is based on error correcting codes, e.g. Goppa codes. Hence, in order to implement the McEliece PKCS one ...
متن کاملHOW SAGE HELPS TO IMPLEMENT GOPPA CODES AND THE McELIECE PUBLIC KEY CRYPTO SYSTEM
Common cryptographic methods, especially Public Key Crypto Systems, PKCS based on difficulty to factor large integers or to compute the discrete logarithm, commonly deployed today will not resist attacks using quantum computers once these are operational. However, there are alternatives like hash based digital signature schemes, lattice based cryptography, or multivariatequadratic-equations pub...
متن کاملCompact McEliece keys based on quasi-dyadic Srivastava codes
The McEliece cryptosystem is one of the few systems to be considered secure against attacks by Quantum computers. The original scheme is built upon Goppa codes and produces very large keys, hence recent research has focused mainly on trying to reduce the public key size. Previous proposals tried to replace the class of Goppa codes with other families of codes, but this was revealed to be an ins...
متن کاملComparison between Separable and Irreducible Goppa Code in McEliece Cryptosystem
The McEliece cryptosystem is an asymmetric type of cryptography based on error correction code. The classical McEliece used irreducible binary Goppa code which considered unbreakable until now especially with parameter [1024, 524, and 101], but it is suffering from large public key matrix which leads to be difficult to be used practically. In this work Irreducible and Separable Goppa codes have...
متن کاملCompact McEliece Keys from Goppa Codes
The classical McEliece cryptosystem is built upon the class of Goppa codes, which remains secure to this date in contrast to many other families of codes but leads to very large public keys. Previous proposals to obtain short McEliece keys have primarily centered around replacing that class by other families of codes, most of which were shown to contain weaknesses, and at the cost of reducing i...
متن کامل